Covering arrays of strength two have been widely studied as combinatorial models of software interaction test suites for pairwise testing. While numerous algorithmic techniques have been developed for the generation of covering arrays with few columns (factors), the construction of covering arrays with many factors and few tests by these techniques is problematic. Random generation techniques c...

covering arrays of strength two have been widely studied as combinatorial models of software interaction test suites for pairwise testing. while numerous algorithmic techniques have been developed for the generation of covering arrays with few columns (factors), the construction of covering arrays with many factors and few tests by these techniques is problematic. random generation techniques c...

In this work we present a new set oriented numerical method for the numerical solution of multi-objective optimization problems. These methods are global in nature and allow to approximate the entire set of (global) Pareto points. After proving convergence of an associated abstract subdivision procedure we use this result as a basis for the development of three different algorithms. We also con...